Optimized asset maintenance and replacement schedule

ABSTRACT

There are provided a system, a method and a computer program product for generating an optimal preventive maintenance/replacement schedule for a set of assets. The method includes receiving data regarding an asset, said data including a failure rate function of said asset, a cost of preventative maintenance (PM) of said asset, a cost of an asset failure, and a cost of replacing an asset. An optimal number K of preventative maintenance time intervals t k  and an indication of a possible replacement is computed and stored for each asset by minimizing a mean cost-rate value function with respect to an electrical age of the asset. A first PM schedule is formed without consideration of labor and budget resource constraints. The method further generates a second maintenance schedule for a system of assets by minimizing a deviation from the optimal PM time intervals subject to the labor and budget resource constraints.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No. 14/551,522, filed Nov. 24, 2014 the entire content and disclosure of which is incorporated herein by reference.

FIELD

This disclosure relates generally to preventative maintenance of assets, and when to carry out preventive maintenance and when to carry out a replacement for a system of assets during a finite time horizon under limited resources.

BACKGROUND

Currently, periodically scheduled maintenance is the most commonly used maintenance policy. There are shortcomings to this: Scheduled maintenance does not take into the future health condition of the asset, thus is often conservative. Condition-based maintenance is performed when an indicator of the health condition of the asset reaches a pre-determined level.

Continuously monitoring the condition indicator and assessing the current system's health condition is difficult, and often results in a high cost of operation.

SUMMARY

There are provided a system, a method and a computer program product for determining when to carry out a preventive maintenance and a replacement for a system of assets during a finite time horizon under limited resources.

An analytics approach is provided that is based on asset aging prediction which exploits different data sources and models such as electrical models, asset data, customer data, and external data.

The system and method provides an optimization decomposition framework consisting of method steps to compute independently the optimal preventive maintenance (PM) time intervals for each asset based on its failure rate function; and determine the maintenance schedule for the system of assets by minimizing the deviation from the optimal PM time intervals subject to the labor and budget resource constraints.

In one aspect, there is provided a method for finding an optimal preventive maintenance/replacement schedule for a set of assets. The method comprises: receiving, at a programmed processor device, data regarding an asset, the data including a failure rate function of the asset, a cost of preventative maintenance (PM) of the asset, a cost of an asset failure, and a cost of replacing an asset; computing, using the programmed processor device, an optimal number of preventative maintenance actions K and time intervals t_(k) for each asset independently by minimizing a mean cost-rate value function with respect to an electrical age of the asset y_(k), wherein the schedule is formed without considering a labor and budget resource constraints; storing the optimal number of preventative maintenance time intervals for each asset as data in a memory storage device; and generating a schedule of the optimal number of time intervals from the stored data.

In a further aspect, there is provided a system for generating an optimal preventive maintenance/replacement schedule for a set of assets. The system comprises: a memory storage device for storing data; a programmed processor device coupled to the memory storage device and configured to: receive data regarding an asset, the data including a failure rate function of the asset, a cost of preventative maintenance (PM) of the asset, a cost of an asset failure, and a cost of replacing an asset; compute an optimal number of preventative maintenance actions K and time intervals t_(k) for each asset independently by minimizing a mean cost-rate value function with respect to an electrical age of the asset y_(k), wherein the schedule is formed without considering a labor and budget resource constraints; store data representing the optimal number of preventative maintenance time intervals for each asset in the memory storage device; and generate a schedule of the optimal number of time intervals from the stored data.

A computer program product is provided for performing operations. The computer program product includes a storage medium readable by a processing circuit and storing instructions run by the processing circuit for running one or more methods. The methods run are the same as listed above.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other objects, features and advantages of the present invention will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings, in which:

FIG. 1 illustrates an example of a general health condition of an asset, e.g., a piece of equipment, as determined by its electrical age;

FIG. 2 illustrates an example of a failure rate function h₀(t) that is input for the maintenance optimization schedule framework and its impact on electrical age;

FIG. 3 shows an example time graph depicting an example schedule of Preventive Maintenance (PM) and replacement (R) costs for an asset;

FIG. 4 shows an example time graph depicting an example schedule of interruption and repair costs corresponding to the schedule of FIG. 3;

FIG. 5 shows a high level methodology 100 for the optimization framework in one embodiment;

FIG. 6A depicts a high level method 200 of calculating the failure rate function h₀(t) which is input for the maintenance optimization scheduling for an asset without labor and budget constraints in one embodiment;

FIG. 6B depicts a high level method 250 of calculating the optimized maintenance scheduler given a set of inputs for a set of assets including labor and budget constraints in one embodiment;

FIG. 7 depicts the failure rate calculation algorithm 300 run by a processor device to provide h₀(t) input to optimization framework in one embodiment;

FIG. 8 depicts an algorithm 350 run by the processor device for automatically computing an optimal number of PM actions K and time intervals t_(k) in one embodiment;

FIG. 9 depicts an algorithm 400 for automatically solving equations PM optimization calculations using non-linear programming in one embodiment;

FIG. 10 depicts a method for computing lower bound and upper bound for the PM intervals calculation in one embodiment;

FIG. 11A depicts an example of a first optimized schedule output for assets given the PM intervals calculations and optimal PMs without consideration of labor and budget constraints in one embodiment;

FIG. 11B depicts an example of a second optimized schedule output for assets given the PM intervals calculations of the first optimized schedule output of FIG. 11A, however with consideration of labor and budget constraints in one embodiment;

FIGS. 12A-12B depict an example comparison of a total expected cost between the optimized maintenance schedules generated by the methods herein, against a cost resulting from a commonly used baseline scheme where a periodic PM is performed;

FIG. 13 illustrates one embodiment of an exemplary hardware configuration of a computing system 800 programmed to perform the method steps as described herein with respect to FIGS. 5-10.

DETAILED DESCRIPTION

A system and method for determining when to perform a preventive maintenance and when to perform a replacement for a set of assets.

Based on the asset aging prediction which exploits different data sources and models such as electrical models, asset data, customer data, and external data.

Thus a system and method is provided for determining when to carry out a preventive maintenance and a replacement for a system of assets during a finite time horizon under limited resources.

Further, a system and method is provided for determining when to do a preventive maintenance and when to do a replacement for a set or system of assets. In the domain of power generation these assets may comprises power transformers and distribution transformers.

As shown in FIG. 1, the general health condition of an asset 50, e.g., a piece of equipment is determined by its electrical age, and a failure rate function h(t) 75 as shown in FIG. 2. The main purpose of a preventive maintenance (PM) is to modify failure rate functions, make them as small as possible. Electrical age is often smaller than the calendar age (or can be improved) if some maintenance activities have been introduced. In the example plot shown in FIG. 2, a first PM time is introduced and as a result effectively reduces the electrical age by an age reduction amount 80 as shown. Preventive maintenance makes an asset's electrical age<calendar age (or smaller than expected electrical age). A number of failures between a time t=a and t=b is given by a relation

∫_(a)^(b)h(t)d t, where h(t) is a failure rate function for that asset.

In one embodiment, an optimization decomposition framework is provided that runs methods including: a first step for computing independently the optimal preventive maintenance (PM) time intervals for each asset based on its failure rate function. A second step for determining the maintenance schedule for the system of assets by minimizing a deviation from the optimal PM time intervals subject to the labor and budget resource constraints.

To formulate an asset maintenance schedule optimization and required data, the system and method receives input data. For purposes of illustration, the assets to be maintained include electrical power transformer devices (transformer). For this description, the following data pertaining to a transformer asset are received including:

1) A given time horizon for planning purpose with a fixed budget constraint, which needs to be represented as Net Present Value (NPV) as the assets are considered as capital investment with longer term usage. In one embodiment, a suggested NPV interest rate may be 6.2%.

2) A set of transformers to be optimized for maintenance schedules, whose current electrical age conditions, failure probability functions, and the projected electrical aging conditions are based, for example, on a projected loading and ambient temperature. Since the scheduling optimization assumes certain discrete time points toward the future for the optimization, the projected electrical ages may be given as a set of electrical ages, each of which is for a period of time duration of the entire planning horizon.

3) A model that reflects the impact of maintenance and replacement on failure probability model parameters, various cost components of transformers, such as the maintenance cost, the replacement cost, and the failure (impact) cost.

4) A set of other constraints that may be considered. The output of this step is an optimized maintenance schedule for the set of assets, e.g., transformers. That is, in an example embodiment, the method models transformer failure probabilities explicitly using failure rate functions (e.g., that capture the health condition of an asset given the asset has survived to some point of time), models the impact of preventive maintenance on failure probability changes, and thus determines an optimal maintenance and replacement schedules for a set of transformers under various constraints.

There is now described the computer-implemented optimization system and method to find an optimal preventive maintenance/replacement schedule for a set of assets, e.g., transformers, under given budget and labor constraints. First, the problem formulation is introduced, and then a solution approach to solve it is given. Since the size of the problem under consideration is very large, which consists of several binary variables in the model, it becomes intractable to try to deal with the unified NP-hard nonlinear problem for the entire system. Thus, the system and method solution separates into two stages: computing optimal maintenance intervals for each transformer independently without considering the global constraints, and then forming a scheduling problem based on the optimal values from the first step taking into account the budget and labor constraints.

Optimized PM Intervals for Individual Unit

One aim of preventive maintenance (PM) activities is to decrease the failure rate and/or the electrical age of a transformer. Is is assumed that PM actions are performed at times t₁, t₁+t₂, . . . , Σ_(i=1) ^(k-1)t_(i) with a cost c_(p) for each PM and a possible replacement is at time Σ_(i=1) ^(K)t_(i) with a cost c_(r) during a fixed time horizon of interest t. The failure rate function is denoted according to Eq. 1) as: h ₀(t)=failure rate function  (1) which will be described in detail later, if no PM intervention is conducted. The effect of PM at the k-th period is characterized by a hybrid model, which models the failure rate function h_(k)(t) between the (k−1)-th and the k-th PMs by changing from the previous time interval h_(k-1)(t) as h _(k)(t)=a _(k) h _(k-1)(b _(k) t _(k-1) +t), where h_(k)(t) is the failure rate function after the k^(th) PM; a_(k) is the adjustment factor in failure rate after the k^(th) PM, b_(k) is the adjustment factor in electrical age due to the k^(th) PM and each adjustment factor a_(k),b_(k) estimated by the PM historical data. Letting y_(k) be the electrical age immediately before the k-th PM, there is had:

$\begin{matrix} {t_{k} = {y_{k} - {b_{k - 1}y_{k - 1}}}} & (2) \\ {y_{k} = {t_{k} + {b_{k - 1}t_{k - 1}} + \ldots + {b_{k - 1}b_{k - 2}\ldots\; b_{1}x_{1}}}} & (3) \\ {{\sum\limits_{i = 1}^{k}t_{i}} = {y_{k} + {\sum\limits_{i = 1}^{k - 1}{\left( {1 - b_{i - 1}} \right){y_{i - 1}.}}}}} & (4) \end{matrix}$

The total failure (impact) cost is computed from

c_(m)∫_(b_(k − 1)y_(k − 1))^(y_(k))h_(k)(t)d t. The following assumptions are made: 1. The failure rate function h₀(t) is continuous and strictly increasing if there are no PM activities; 2. A minimal repair is carried out for a failure between PMs, and it only restores the function of the unit, but does not change the failure rate; 3. PM, repair, and replacement times are negligible; 4. A unit is “good-as-new” after a replacement.

The method includes determining the optimal scheduled intervals t_(k) by minimizing the mean cost-rate, represented as a function with respect to the electrical age y_(k), which is achieved by distinguishing two cases:

If there is no need to replace, the mean cost-rate optimization problem is formulated as

$\begin{matrix} {{\min\limits_{y,K}\;{f_{1}\left( {y,K} \right)}} = {{c_{p}\left( {K - 1} \right)} + {c_{m}{\sum\limits_{k = 1}^{K}{\int_{b_{k - 1}y_{k - 1}}^{y_{k}}{{h_{k}(t)}d\; t}}}}}} & (5) \end{matrix}$

$\begin{matrix} {{{{s.t.\mspace{11mu} y_{k}} - {b_{k - 1}y_{k - 1}}} \geq 0},{k = 1},\ldots\;,K} & (6) \\ {{y_{K} + {\sum\limits_{k = 1}^{K - 1}{\left( {1 - b_{k - 1}} \right)y_{k - 1}}}} = \overset{\_}{t}} & (7) \\ {{y_{k} \geq 0},{k = 1},\ldots\;,{K.}} & (8) \end{matrix}$

The objective function (5) is the total cost of the unit over the fixed time horizon t, including the cost for K−1 PMs and the expected cost of repairs for failures. The method imposes the positivity condition for the time intervals t_(k) in (6) and the electrical age y_(k) in (8), respectively. That is y_(k) is the electrical age just before the k^(th) PM. The constraint (7) is the length of the scheduled horizon. Note that at time Σ_(k=1) ^(K)t_(k)=t, there may be no a PM. The mean cost-rate is equal to the objective function value (5) divided by t.

If the transformer needs to be replaced, the optimization problem becomes

$\begin{matrix} {{\min\limits_{y,K}\;{f_{2}\left( {y,K} \right)}} = \frac{{c_{p}\left( {K - 1} \right)} + c_{r} + {c_{m}{\sum\limits_{k = 1}^{K}{\int_{b_{k - 1}y_{k - 1}}^{y_{k}}{{h_{k}(t)}d\; t}}}}}{y_{K} + {\sum\limits_{k = 1}^{K - 1}{\left( {1 - b_{k - 1}} \right)y_{k - 1}}}}} & (9) \\ {{{{s.t.\mspace{11mu} y_{k}} - {b_{k - 1}y_{k - 1}}} \geq 0},{k = 1},\ldots\;,K} & (10) \\ {{y_{K} + {\sum\limits_{k = 1}^{K - 1}{\left( {1 - b_{k - 1}} \right)y_{k - 1}}}} \leq \overset{\_}{t}} & (11) \\ {{y_{k} \geq 0},{k = 1},\ldots\;,{K.}} & (12) \end{matrix}$

The numerator of (9) comprises a replacement cost and the denominator is the total life of the transformer. Constraint (11) requires a replacement before the time t. The method solves the two problems (5-8) and (9-12) simultaneously and selects the PM schedule associated with that of a smaller mean cost-rate. It is noticed that the above formulations have an integer variable K and continuous variables y_(k)'s. The optimum number of PM intervals K is calculated by explicit enumeration. For a fixed K, they are nonlinear continuous optimization problems, which can be written as the following general format with a nonlinear objective function ƒ for both problems (5) and (9):

$\begin{matrix} {{{\min\limits_{y \in \Omega}\;{{f(y)}\mspace{14mu}{s.t.\mspace{14mu}\Omega}}} = \left\{ {y:{{Ay} \leq b}} \right\}},} & (13) \end{matrix}$ where A is a matrix, b is a vector. Because h₀ is continuous, hence ƒ is differentiable. In one embodiment, the method solves the optimization problem by a gradient projection algorithm, where the projection is a linearly constrained least squares problem. The warm-start capability of the gradient projection algorithm is exploited when increasing the value of K.

FIG. 3 shows a time graph 90 depicting an example schedule of Preventive Maintenance (PM) and replacement (R) costs where cost is a value (K−1) c_(p)+c_(r) where c_(p) is the cost of preventative maintenance (e.g., at times t₁-t₃; c_(r) is the cost of a replacement at time t₄; K is the number of preventative maintenance intervals; t_(k) is a time for the preventative maintenance and PM_(k) is the k^(th) preventative maintenance.

FIG. 4 shows a time graph 95 depicting an example schedule of interruption and repair costs corresponding to the schedule of FIG. 3, wherein h(t) is the failure rate function; h_(k)(t) is the failure rate function at the k^(th) PM; H_(k) (t) is the cumulative failure rate ∫h_(k)(t)dt; ∫_(b) _(k-1) _(y) _(k-1) ^(y) ^(k) (t)dt=H_(k)(y_(k))−H_(k)(b_(k-1), y_(k-1))=the expected number of failures in [t_(k-1), t_(k)]; c_(ƒ) is a cost of a failure;

${{{total}\mspace{14mu}{failure}\mspace{14mu}{cost}} = {c_{f}{\sum\limits_{k = 1}^{K}\left\lbrack {{H_{k}\left( y_{k} \right)} - {H_{k}\left( {b_{k - 1},y_{k - 1}} \right)}} \right\rbrack}}};y_{k}$ is the electrical age of the asset just before the k^(th) PM; and b_(k) is the adjustment factor in electrical age due to the k^(th) PM. Optimized Maintenance and Replacement Schedule

In operation, there are some operational and economical constraints for the entire asset system such as labor and budget availability for each period. If the PM planning based on the solution described in the first step herein above is deployed, some of these constraints may be violated. Thus, one scheduling strategy is to obey the global constraints for the final planning, but possibly readjust the optimal scheduled PM intervals for each transformer obtained from the first step. It is assumed that after a replacement, a brand-new unit with the same type is used. The continuous time horizon t is discretized into a finite evenly spaced time intervals I. The model performs minimizing the total deviation from the optimal PM intervals given from the first stage results. The following parameter notations are used in this embodiment:

[N] set of assets;

[I] set of time intervals;

[K_(n)] set of PMs and a possible replacement for the n-th asset;

[r_(n)] period for a replacement of the n-th asset;

[w_(n)] impact weight of the n-th asset;

[t^(k,n)] optimal PM intervals for the n-th asset obtained from the first stage;

[γ_(n)] manpower for a PM of the n-th asset;

[β_(n)] manpower for a replacement of the n-th asset;

[θ_(n)] cost (e.g., in $) for a PM of the n-th asset;

[ρ_(n)] cost (e.g., in $) for a replacement of the n-th asset;

[h_(i)] maximum manpower availability during the i-th interval;

[m_(i)] maximum budget availability during the i-th interval (e.g., in $);

[m] total budget availability during I time intervals (e.g., in $);

[r] interest rate for net present value (NPV);

[i_(l) ^(k,n)] lower bound for the deviation of the k-th PM or a replacement of the n-th asset;

[i_(u) ^(k,n)] upper bound for the deviation of the k-th PM or a replacement of the n-th asset;

The following variable notation is used in this embodiment:

[x_(i) ^(k,n)] binary variable indicating whether the k-th PM or a replacement is conducted for the n-th asset during the i-th interval (also referred to as z_(i) ^(k,n)).

Utilizing processor device and memory resources, the method minimizes an objective function of the total deviation

$\begin{matrix} {\min\limits_{x_{i}^{k,n} \in {\{{0,1}\}}}{\sum\limits_{{i \in I},{n \in N},{k_{n} \in K_{n}}}{w_{n}x_{i}^{k_{n},n}{{i - t^{k_{n},n}}}}}} & (14) \end{matrix}$

The above objective function is subject to the following set of constraints:

-   -   1. Number of PMs for the n-th asset

$\begin{matrix} {{{\sum\limits_{{i \in I},{k_{n} \in K_{n}}}x_{i}^{k_{n},n}} = K_{n}},{n \in N}} & (15) \end{matrix}$

-   -   2. The k-th PM or a replacement is performed between [i_(l)         ^(k,n), i_(u) ^(k,n)]

$\begin{matrix} {{{\sum\limits_{i_{l}^{k,n} \leq i \leq i_{u}^{k,n}}x_{i}^{k_{n},n}} = 1},{k_{n} \in K_{n}},{n \in N}} & (16) \\ {{x_{i}^{k_{n},n} = {{0\mspace{14mu}{if}\mspace{14mu} i} \neq \left\lbrack {i_{l}^{k,n},i_{u}^{k,n}} \right\rbrack}},{k_{n} \in K_{n}},{n \in N}} & (17) \end{matrix}$

-   -   3. Maximum manpower availability at the i-th interval

$\begin{matrix} {{{{\sum\limits_{{n \in N},{k_{n} = 1},\ldots\;,{K_{n} - 1}}{\gamma_{n}x_{i}^{k_{n},n}}} + {\sum\limits_{n \in N}{\beta_{n}x_{i}^{K_{n},n}}}} \leq h_{i}},{i \in I}} & (18) \end{matrix}$

-   -   4. Maximum budget availability at the i-th interval

$\begin{matrix} {{{{\sum\limits_{{n \in N},{k_{n} = 1},\ldots\;,{K_{n} - 1}}{\theta_{n}x_{i}^{k_{n},n}}} + {\sum\limits_{n \in N}{\rho_{n}x_{i}^{K_{n},n}}}} \leq m_{i}},{i \in I}} & (19) \end{matrix}$

-   -   5. Total budget

$\begin{matrix} {m_{1} = {{\frac{m_{2}}{1 + r} + \frac{m_{3}}{\left( {1 + r} \right)^{2}} + \ldots + \frac{m_{I}}{\left( {1 + r} \right)^{I - 1}}} \leq m}} & (20) \end{matrix}$

-   -   6. No replacement condition         x _(i) ^(K) ^(n) ^(,n)=0, iϵN if r _(n)>0.  (21)

Without the global labor and budget constraints, the optimal solution from the first stage is also the optimal solution for the scheduling problem, i.e., no readjustment is needed. For important assets such as transformers that are close to hospitals and schools, the solution from the first stage should be used, which is done by selecting a high value for w_(n). Constraints (16) and (17) not only ensure the deviation is not too large so as to retain the efficient schedule from the first stage, but also help to significantly reduce the number of binary variables for the formulation. It can remove up to 90% of binary variables, making the model attractive for a large scale system. The optimization problem (equations 14-19) is an integer linear programming problem, which can be efficiently solved by some MILP solvers such as IBM ILOG CPLEX Optimizer,” (http://www.ibm.com).

FIG. 5 shows a high level methodology 100 for the optimization framework. In particular, a computer-implemented solution is provided in which the problem is addressed first at 110 by calculating the failure rate function h₀(t) of an asset as presented in (1). Then, at 120, the method comprises computing independently the optimal preventive maintenance time intervals for each asset based on its failure rate function by inputting the failure rate function h₀(t) to a programmed processor unit and solving equations 5)-8) and 9)-12) using the programmed processor unit, and outputting a schedule of time intervals; and, at 130, determining, using the processor unit, the maintenance schedule for the system of assets by minimizing the deviation from the optimal PM time intervals subject to the labor and budget resource constraints, and outputting the schedule. For non-limiting purposes of illustration, the asset is an electrical power transformer, part of a system of transformers.

With respect to step 110, FIG. 5, FIG. 6A depicts a high level method 200 of calculating the failure rate function h₀(t) as presented in equation (1), which is input for the maintenance optimization scheduling for an asset. It is first assumed that the asset failure rate has a Weibull distribution defined as: h _(inital)(t)=βt ^(α).

Input parameters at 210 thus include Weibull parameters, a current age of the asset, the number of simulation intervals; a time interval for simulation and an accelerated aging factor “acc_factor”. For an example electrical power transformer asset, in one embodiment, it is supposed that the transformer has been installed for t₀ years, and the transformer aging calculation outputs accelerated aging factor “acc_factor” for a set of N future time periods with a simulation time interval Δt. For a given time t, there is defined:

${N_{0} = \left\lbrack \frac{t}{\Delta\; t} \right\rbrack},$ where [x] returns the largest integer not greater than x. As depicted at step 220, FIG. 6A, the failure rate function taking the aging factor into consideration is computed according to:

$\begin{matrix} {{h_{acc}(t)} = {{\beta\left( {t_{0} + {\Delta\; t{\sum\limits_{i = 1}^{N_{0}}{{}_{}^{}{}_{}^{}}}} + {{{}_{}^{}{}_{N_{0} + 1}^{}}\left( {t - {N_{0}\Delta\; t}} \right)}} \right)}^{\alpha}.}} & (22) \end{matrix}$

It can be verified that h_(acc)(t) is a discontinuous function, thus problems (5) and (9) are very difficult to be solved. The method smoothens the function around the breakpoints by a linear approximation using a small number ϵ close to 0, for example, ϵ=0.01. Thus, defining t=N ₀ Δt+(1−ϵ)Δt, and {circumflex over (t)}=(N ₀+1)Δt.

The approximated failure rate function h₀(t) output at 230 is defined as follows:

$\begin{matrix} {{h_{0}(t)} = \left\{ {\begin{matrix} {{h_{acc}(t)},} & {{{if}\mspace{14mu} t} \leq \underset{\_}{t}} \\ {{{\frac{{h_{acc}\left( \hat{t} \right)} - {h_{acc}\left( \underset{\_}{t} \right)}}{\hat{t} - \underset{\_}{t}}\left( {t - \underset{\_}{t}} \right)} + {h_{acc}\left( \underset{\_}{t} \right)}},} & {otherwise} \end{matrix}.} \right.} & (23) \end{matrix}$

As shown in FIG. 6A, the failure rate calculation implements an algorithm for computing the h₀(t) output 230. FIG. 7 depicts the failure rate calculation algorithm 300 run by the processor unit to provide h₀(t) output. That is, given Weibull parameter inputs α, β, a current age t₀ of the transformer (asset), a number of simulation intervals N, a time interval Δt for simulation, the aging factor acc_factor, and ϵ=0.01 at 301, the processor unit running algorithm 300 either computes h₀(t) at 310 for the case where t≥NΔt, computes h₀(t) at 320 for the case where t≤√{square root over (t)} or computes h₀(t) at 330 for the case where t>t.

Individually Optimized Schedule

It is noticed that an optimal maintenance policy for an asset (e.g., a transformer) involves two decision variables: the number of PMs and a possible replacement K, and the PM intervals t_(i) (equivalently, y_(i) due to equation (4) herein above).

FIG. 6B depicts a high level method 250 of calculating the optimized maintenance scheduler given a set of inputs 260 including a number N of transformers, a number of PM time intervals I, an impact factor w_(n), PM intervals t^(k,n), a number K_(n) of PM intervals, a total budget in, an interest rate r, and max manpower h_(i), manpower parameters γ_(n), β_(n), and cost parameters θ_(n),ρ_(n) inputs. Given the inputs, the processor unit performs an algorithm at 270 to compute the finalized maintenance schedule. As part of the process, the final optimized scheduler implements an algorithm that computes a binary variable x_(i) ^(k,n) output 280. In one embodiment, x_(i) ^(k,n)ϵ{0,1}:=1 if the k^(th) PM is performed for the n^(th) transformer at i^(th) interval.

More particularly, the objective for calculating the optimized maintenance scheduler subject to the labor and budget resource constraints is to minimize a total deviation from the optimal PM intervals t^(k,n), i.e.,

$\min\limits_{x_{i}^{k,n} \in {\{{0,1}\}}}{\sum\limits_{{i \in I},{n \in N},{k_{n} \in K_{n}}}{w_{n}x_{i}^{k_{n},n}{{{i - t^{k_{n},n}}}.}}}$

FIG. 8 depicts an algorithm 350 run by a processor unit, for computing an optimal number of PM actions K. In the algorithm 350, implemented in a processing loop for finding optimal PM intervals t_(k), with an iteration finding an optimal value K (e.g., the optimium number of PM intervals) and y_(i) (e.g., the output used to calculate the PM time points t_(k)). As shown in the algorithm 350 of FIG. 8, for a fixed k, problems of equations 5)-8) and 9)-12) are solved. They are compactly recast as a general optimization problem as in equation (13). The algorithm 350 for solving equation (13) needs to evaluate problem functions at a given point y. Thus, as shown in FIG. 8, there is input to the algorithm 350 the objective function ƒ(y)-particularly, ƒ₁(y,K), ƒ₂(y,K), and K_(max), which is run to solve equations 5)-8) and 9)-12) and generate the optimal values K_(opt) and y_(opt) for output. For example, the algorithm implements a processing loop 360 for k=0, . . . , K_(max) to solve equations 5)-8) at 370 using y⁰ as a starting point to get ƒ₁(y,k) and to solve equations 9)-12) at 380 using y⁰ as a starting point to get ƒ₂(y,k) from which both K_(opt) and y_(opt) are obtained. The variable ƒ_(temp) takes the smallest value among ƒ₁(y,k), ƒ₂(y,k). In one embodiment, the algorithm 400 depicted in FIG. 9 is used in the algorithm 350 at steps 370, 380 to obtain respective values for ƒ₁(y,k), ƒ₂ (y,k). In algorithm 350 the loop processing 360 provides output K_(opt) which is the optimum number of PM intervals; and the output y_(opt) in algorithm 350 is used in equation 4) to calculate the PM time points t_(i).

In one embodiment, as both optimization problems (equations 5-8) and (equations 9-12) can be recast in the same general framework (13), and the algorithm 400 depicted in FIG. 9 is used to solve the problem of equation 13). That is, in one embodiment, the algorithm 400 shown in FIG. 9, solves the equations 5)-8) and equations 9)-12) one at a time using a CPLEX solver, e.g., CPLEX with Concert Technology, in which the objective function is ƒ(y), and ∇ƒ(y) is the gradient of the objective, and a projection of y onto a feasible region Ω is denoted P_(Ω)(y). In view of algorithm 400 of FIG. 9, there is a loop processing comprising steps 4 through step 10 in which index i is iterated with check conditions provided at 410 to determine if the quantity ∥P_(Ω)(y^(i)−∇ƒ(y^(i)))−y^(i)∥<ϵ which stops the iteration if satisfied. Thus, method steps 410 et seq. solves a projection sub-problem arising from the gradient projection algorithm which sub-problem is to compute P_(Ω)(y^(i)−∇ƒ(y^(i))) by CPLEX solver.

The integer linear problem programming (of equations 14-19) is also solved by the CPLEX solver, e.g., CPLEX with Concert Technology. The model is invoked by calling CPLEX for the reduced MIP problem. In one embodiment, there are two strategies that are implemented to reduce the size of problem (of equations 14-19): In a first strategy, a determination is made as to whether the value input for the impact weight w_(n) is bigger than a threshold. In one embodiment, the threshold may comprise the median of w_(n). If by comparison the input impact weight value w_(n) is greater than the threshold, then the maintenance schedule is fixed and computed for the n^(th)-asset. Additionally, the method selects suitable values for a lower bound i_(l) ^(k,n) and an upper bound i_(u) ^(k,n) in equations (16) and (17), respectively. In one embodiment, a method for computing a lower bound PM interval and an upper bound for PM interval is shown in the example pseudo-code description 500 of an algorithm as depicted in FIG. 10.

Without the global labor and budget constraint, the optimal solution from the first stage is also the optimal solution for the scheduling problem, i.e., no readjustment is needed. For an important asset such as those transformers that are close to hospitals and schools, the solution from the first stage may be used, which is done by selecting a high value for w_(n). Constraints in equations 16)-17) not only ensure the deviation is not too large so as to retain the efficient schedule from the first stage, but also help to significantly reduce the number of binary variables for the formulation because x_(i) ^(k,n)=0 for any index i outside of the range [i_(l), i_(u)]. That is, implementation of the algorithm of FIG. 10 and the fixing of some schedule from the 1^(st) stage processing based on impact weight help to remove up to 90% of binary variables that makes the model attractive for a large scale system. The optimization problem in equations 14)-21) is an integer linear problem programming, which can be efficiently solved by some MILP solvers such as CPLEX.

An example implementation follows: given a planning horizon for the set of transformers of four years with one month time interval being selected in this example. A CPLEX version 12.5 solver is implemented to solve the scheduling problem (13)-(21) and the projection sub-problem arising from the gradient projection algorithm. The impact weight factor w_(n) is calculated based on the number of customers downstream.

FIG. 11A illustrates an example output 600 after each stage for four transformers. The example output schedule 600 shows the PM action results for the first stage problem where each transformer is optimized independently. Times to carry out a PM activity is reported, e.g., according to a number of month intervals over a planning horizon. In the embodiment shown, only the third transformer (Trans 3) does not need a replacement during the scheduled time horizon. In the example output 600 depicted in FIG. 11A, optimal planned replacements are shown circled.

It is observed that the outputs from the first stage problem violate some global constraints such as the budget availability for the 22^(nd) month as indicated at 610 in FIG. 11A. The second stage problem resolves the issue by solving a system-wide problem when selecting a solution as close as possible with the solution from the first stage problem, which is achieved by the scaled objective function (equation 14). FIG. 11B depicts an example of a second optimized schedule 650 output for assets given the PM intervals calculations of the first optimized schedule output 600 of FIG. 11A, however with consideration of labor and budget constraints. The resulting output schedule 650 generated from the second stage problem processing adjusts the second PM of the third transformer for a month later, i.e., at the 23rd month, at 660, to remove the budget constraint for that period.

As shown in FIGS. 12A-12B, an example of a total expected cost between the optimized maintenance schedules are compared with a cost resulting from a commonly used baseline scheme, called the “run-to-failure,” where a periodic PM is performed. The replacement time for the periodic strategy is determined based on the excess of a threshold for the expected numbers of failures computed from the failure rate function. FIGS. 12A-12B show a final PM result comparison output 700 for a set of transformers. The methods described herein produce a PM schedule of PM intervals for the four assets as shown at 702, 704, 706 and 708. As seen, transformer schedules 702 and 708 include a PM interval for asset replacement. The periodic PM schedules resulting from a baseline approach, as depicted at 703, 705, 707, 709 for each respective transformer, incurs a higher expected cost for all cases as shown in the last column at 720. For the second transformer, there is no need for a replacement during the planned time horizon, while the baseline requires a replacement, which results in a much higher cost. For the case study of 400 transformers within a 4 year plan for $14.5 million of budget, an optimized scheduled spends $13.7 million, while the baseline needs an amount of $17.6 million.

The preventative maintenance scheduling system herein can be used for assets, i.e., equipments in many industries, e.g., for the Energy and Utility, Transportation, Manufacturing, Oil and Gas industries. Implementations of the methods and systems herein provide a maintenance and replacement policy that gives a minimal total cost for the system including the maintenance and replacement costs, interruption cost, and repair cost.

FIG. 13 shows a schematic of an example of a computing system 800 capable of being implemented and/or performing any of the functionality set forth hereinabove.

In computing system 800 there is a computer system/server 812, which is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with computer system/server 812 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed computing environments that include any of the above systems or devices, and the like.

Computer system/server 812 may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system/server 812 may be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.

As shown in FIG. 13, computer system/server 812 is shown in the form of a general-purpose computing device. The components of computer system/server 812 may include, but are not limited to, one or more processors or processing units 816, a system memory 828, and a bus 818 that couples various system components including system memory 828 to processor 816.

Bus 818 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.

Computer system/server 812 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer system/server 812, and it includes both volatile and non-volatile media, removable and non-removable media.

System memory 828 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 870 and/or cache memory 872. Computer system/server 812 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 834 can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to bus 818 by one or more data media interfaces. As will be further depicted and described below, memory 828 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.

Program/utility 845, having a set (at least one) of program modules 842, may be stored in memory 828 by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating system, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Program modules 842 generally carry out the functions and/or methodologies of embodiments of the invention as described herein.

Computer system/server 812 may also communicate with one or more external devices 814 such as a keyboard, a pointing device, a display 824, etc.; one or more devices that enable a user to interact with computer system/server 812; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 812 to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces 822. Still yet, computer system/server 812 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 820. As depicted, network adapter 860 communicates with the other components of computer system/server 812 via bus 818. It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system/server 812. Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.

The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions. These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. 

What is claimed is:
 1. A method for decreasing a failure rate of each asset of a set of assets comprising: receiving, at a programmed hardware processor, data regarding an asset, said data including a failure rate function capturing a condition of said asset up to a point in time, a cost of preventative maintenance (PM) of said asset, a cost of an asset failure, and a cost of replacing an asset; receiving, at said programmed hardware processor, a further input specifying a time horizon; determining, at said programmed hardware processor, whether there is a need to replace said asset, and when a replacement of said asset is needed: computing, at said programmed hardware processor, a mean cost-rate optimization problem formulated as an objective function of a total cost of the asset over said specified time horizon, said total cost being a function of a cost of preventative maintenance (PM) of said asset for K−1 PMs, and an expected cost of repairs for an asset failure computed as a function of said failure rate function, and the cost of replacing an asset; computing, using the programmed hardware processor, an optimal number of preventative maintenance actions K and time intervals t_(k) for each asset independently by minimizing said objective function with respect to an age of the electrical asset y_(k), where k represents a k^(th) PM, wherein said schedule is formed without considering a labor and budget resource constraint; and the programmed hardware processor device further storing said optimal number of preventative maintenance time intervals for each asset as data in a memory storage device operatively coupled with said processor device; and the programmed hardware processor device generating a final maintenance schedule for the system of assets based on stored said optimal number of preventative maintenance time intervals by minimizing a deviation from the computed optimal PM time intervals subject to the labor and budget resource constraints.
 2. The method of claim 1, wherein said optimal number of preventative maintenance time intervals includes: a number K of PM intervals and an indication of a possible replacement; and a time interval t_(k) for the k^(th) PM.
 3. The method of claim 2, further comprising: receiving, at said programmed hardware processor, an input specifying a time horizon; determining, at said programmed hardware processor, by said processor device, whether there is a need to replace said asset, and with no replacement needed, determining, at said programmed hardware processor, the optimal scheduled intervals t_(k) by minimizing a first mean cost-rate optimization problem formulated as a first objective function of a total cost of the asset over said specified time horizon, said total cost being a function of a cost of preventative maintenance (PM) of said asset for K−1 PMs, and an expected cost of repairs for an asset failure computed as a function of a failure rate function.
 4. The method of claim 3, wherein the first objective function of a total cost of the asset to be minimized is represented as f₁(y, K) such that: ${\min\limits_{y,K}\;{f_{1}\left( {y,K} \right)}} = {{c_{p}\left( {K - 1} \right)} + {c_{m}{\sum\limits_{k = 1}^{K}{\int_{b_{k - 1}y_{k - 1}}^{y_{k}}{{h_{k}(t)}d\; t}}}}}$ subject to at least one constraint, wherein c_(p) is a cost of a preventive maintenance (PM) for said asset, K is the number of PMs for said asset, c_(m) is the cost of an asset failure, h_(k)(t) is a failure rate function of said asset at the k^(th) PM, y_(k) is the electrical age of said asset just before the k^(th) PM, and b_(k) is an adjustment factor in electrical age due to the k^(th) PM.
 5. The method of claim 1, wherein the objective function of a total cost of the asset to be minimized is represented as f₂(y, K) such that: ${\min\limits_{y,K}\;{f_{2}\left( {y,K} \right)}} = \frac{{c_{p}\left( {K - 1} \right)} + c_{r} + {c_{m}{\sum\limits_{k = 1}^{K}{\int_{b_{k - 1}y_{k - 1}}^{y_{k}}{{h_{k}(t)}d\; t}}}}}{y_{K} + {\sum\limits_{k = 1}^{K - 1}{\left( {1 - b_{k - 1}} \right)y_{k - 1}}}}$ subject to at least one constraint, wherein c_(p) is a cost of a preventive maintenance (PM) for said asset, K is the number of PMs and a possible replacement for said asset, c_(r) is the cost of replacing the asset, c_(m) is the cost of an asset failure, h_(k)(t) is a failure rate function of said asset at the k^(th) PM, y_(k) is the electrical age of said asset just before the k^(th) PM, and b_(k) is an adjustment factor in electrical age due to the k^(th) PM.
 6. The method of claim 1, wherein computing a failure rate function h₀(t) of an asset comprises: receiving, at said programmed hardware processor, parameter values comprising: Weibull parameter input values α, β, a current age t₀ of the asset, a number of simulation intervals N, a time interval Δt for simulation, an asset aging factor acc_factor, and a given time t wherein ${N_{0} = \left\lbrack \frac{t}{\Delta\; t} \right\rbrack};$ and computing, at said programmed hardware processor: ${h_{acc}(t)} = {\beta\left( {t_{0} + {\Delta\; t{\sum\limits_{i = 1}^{N_{0}}{{}_{}^{}{}_{}^{}}}} + {{{}_{}^{}{}_{N_{0} + 1}^{}}\left( {t - {N_{0}\Delta\; t}} \right)}} \right)}^{\alpha}$ wherein said failure rate function h₀(t) is said h_(acc)(t) when t is less than or equal to said specified time horizon.
 7. The method of claim 1, wherein said minimizing a deviation from the optimal PM time intervals subject to the labor and budget resource constraints comprises: solving, using parallel integer linear programming at said programmed hardware processor: ${\min\limits_{x_{i}^{k,n} \in {\{{0,1}\}}}{\sum\limits_{{i \in I},{n \in N},{k_{n} \in K_{n}}}{w_{n}x_{i}^{k_{n},n}{{i - t^{k_{n},n}}}}}},$ subject to constraints, wherein w_(n) is an impact weight of the n-th asset; t^(k,n) is the optimal PM intervals for the n-th asset; and x_(i) ^(k,n) binary variable indicating whether the k-th PM or a replacement is conducted for the n-th asset during an i-th interval, and said labor and budget resource constraints comprises: a number of PMs for the n-th asset, a k^(th) PM being performed within a lower bound and upper bound deviation of the k^(th) PM of the n-th asset, a total budget constraint, a maximum manpower availability at the i-th interval, and a maximum budget availability at the i-th interval.
 8. The method of claim 7 further comprising: comparing, at said programmed hardware processor, said impact weight w_(n) against a threshold; and if the impact is bigger than said threshold: fixing, using said programmed hardware processor, a maintenance schedule computed for the n-the asset; and selecting, by said programmed hardware processor, values for said lower and upper bounds for PM intervals to reduce a size of integer linear programming problem. 